#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <map>
using namespace std;

int ladder(string beginWord, string endWord, vector<string>& wordList)
{
	if(beginWord.size() == 0 || endWord.size() == 0){
		return -1;
	}
	
	int res=0;
	deque<string*> recde;
	map<string*,bool> recmap;
	for(int i=0;i< wordList.size() ;++i){
		recmap.insert({&wordList[i],false});
	}
	recde.push_front(&beginWord);
	while(recde.size() != 0){
		string *p = recde.front();
		recde.pop_front();
	}

}

int main(int argc, char* argv[])
{

    return 0;
}
